The Best Bounds in a Theorem of Russell Lyons

نویسندگان

  • RUSSELL LYONS
  • Philippe MARCHAL
چکیده

We sharpen a bound in a theorem of Russell Lyons [4] for percolation on a tree and associated random walk.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expansion properties of random Cayley graphs and vertex transitive graphs

The Alon-Roichman theorem states that for every ε > 0 there is a constant c(ε), such that the Cayley graph of a finite group G with respect to c(ε) log |G| elements of G, chosen independently and uniformly at random, has expected second largest eigenvalue less than ε. In particular, such a graph is an expander with high probability. Landau and Russell, and independently Loh and Schulman, improv...

متن کامل

Upper Bounds for the Spectral Function on Homogeneous Spaces via Volume Growth

We use the so-called spectral embedding to give upper bounds on the spectral function of the Laplace-Beltrami operator on homogeneous spaces in terms of the volume growth of balls. In the case of compact manifolds, our bounds extend the 1980 lower bound of Peter Li [Li80] for the smallest positive eigenvalue to all eigenvalues. We also improve Li’s bound itself. Our bounds translate to explicit...

متن کامل

The Sign-Real Spectral Radius for Real Tensors

In this paper a new quantity for real tensors, the sign-real spectral radius, is defined and investigated. Various characterizations, bounds and some properties are derived. In certain aspects our quantity shows similar behavior to the spectral radius of a nonnegative tensor. In fact, we generalize the Perron Frobenius theorem for nonnegative tensors to the class of real tensors.

متن کامل

Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales

The Alon-Roichman theorem states that for every ε > 0 there is a constant c(ε), such that the Cayley graph of a finite group G with respect to c(ε) log |G| elements of G, chosen independently and uniformly at random, has expected second largest eigenvalue less than ε. In particular, such a graph is an expander with high probability. Landau and Russell, and independently Loh and Schulman, improv...

متن کامل

On Lower and Upper Bounds of Matrices

k=1 |ak|. Hardy’s inequality can be interpreted as the lp operator norm of the Cesàro matrix C, given by cj,k = 1/j, k ≤ j, and 0 otherwise, is bounded on lp and has norm ≤ p/(p − 1) (The norm is in fact p/(p − 1)). It is known that the Cesàro operator is not bounded below, or the converse of inequality (1.1) does not hold for any positive constant. However, if one assumes C acting only on non-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997